Numerical stability of surface implicitization

نویسندگان

  • Josef Schicho
  • Ibolya Szilágyi
چکیده

In geometric modelling surfaces can be given essentially in two ways: implicit and parametric form. The automatic transition between the implicit and the parametric representations of surfaces is of fundamental importance. In the literature there are several symbolic/numeric implicitization techniques based on resultants [1], Gröbner–basis [2], moving surfaces [3], linear algebra [4], but the numerical stability of these algorithms is not discussed. Computing the implicit form of a surface, small changes in the input can result in large changes in the output. Using floating point numbers it is necessary to give a guarantee that the computed implicit form represents a surface close to the desired one. In this poster we define a condition number for implicitization of surfaces. We show, that the error in the computed implicit surface, arising from the perturbation of the parametric form, is below the product of the condition number and the input error. Using the condition number we test the numerical stability of various implicitization algorithms. Here we do this for the algorithm of moving lines for cubic surfaces, and for the variation of this algorithm using singular value decomposition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implicitization of curves and (hyper)surfaces using predicted support

We reduce implicitization of rational planar parametric curves and (hyper)surfaces to linear algebra, by interpolating the coefficients of the implicit equation given a superset of its terms. For predicting these terms, we focus on methods that exploit input and output structure in the sense of sparse (or toric) elimination theory, namely by computing the Newton polytope of the implicit polynom...

متن کامل

Implicit matrix representations of rational Bézier curves and surfaces

We introduce and study a new implicit representation of rational Bézier curves and surfaces in the 3-dimensional space. Given such a curve or surface, this representation consists of a matrix whose entries depend on the space variables and whose rank drops exactly on this curve or surface. Our approach can be seen as an extension of the moving lines implicitization method introduced by Sederber...

متن کامل

Sparse implicitization by interpolation: Geometric computations using matrix representations

Based on the computation of a superset of the implicit support, implicitization of a parametrically given (hyper)surface is reduced to computing the nullspace of a numeric matrix. Our approach exploits the sparseness of the given parametric equations and of the implicit polynomial. In this work, we study how this interpolation matrix can be used to reduce some key geometric predicates on the (h...

متن کامل

Approximate implicitization using linear algebra

We consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating-point implementation in computer-aided geometric design CAGD systems. We unify the approaches under the names of commonly known polynomial basis func...

متن کامل

Fast Approximate Implicitization of Envelope Curves using Chebyshev Polynomials

Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly, we employ an adaptation of approximate implicitization to envelope computation. Moreover, by utilizing an orthogonal basis in the construction process, the c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2005